Infinite Paths of Minimal Length on Suborbital Graphs for Some Fuchsian Groups
نویسندگان
چکیده
منابع مشابه
On suborbital graphs for some Hecke groups
In this paper, we examine some properties of suborbital graphs for the Hecke groups , H ( √ 2); and H ( √ 3) on Q̂; √ 2Q̂; and √ 3Q̂, respectively. In addition, we give necessary and su3cient conditions for the suborbital graph G(∞; (u=n)√m) to be a forest. Finally, we completely 'nd the number of sides of all the circuits in the suborbital graphs. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملInfinite paths in planar graphs III, 1-way infinite paths
An infinite graph is 2-indivisible if the deletion of any finite set of vertices from the graph results in exactly one infinite component. Let G be a 4-connected, 2indivisible, infinite, plane graph. It is known that G contains a spanning 1-way infinite path. In this paper, we prove a stronger result by showing that, for any vertex x and any edge e on a facial cycle of G, there is a spanning 1-...
متن کاملSolutions to some congruence equations via suborbital graphs
We relate the connection between the sizes of circuits in suborbital graph for the normalizer of [Formula: see text] in PSL(2,[Formula: see text]) and the congruence equations arising from related group action. We give a number theoretic result which says that all prime divisors of [Formula: see text] for any integer u must be congruent to [Formula: see text].
متن کاملMinimal Length Elements in Some Double Cosets of Coxeter Groups
We study the minimal length elements in some double cosets of Coxeter groups and use them to study Lusztig’s G-stable pieces and the generalization of G-stable pieces introduced by Lu and Yakimov. We also use them to study the minimal length elements in a conjugacy class of a finite Coxeter group and prove a conjecture in [GKP].
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 2019
ISSN: 0161-1712,1687-0425
DOI: 10.1155/2019/7652729